Further results on permutation trinomials over finite fields with even characteristic

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic

In this paper, a class of permutation trinomials of Niho type over finite fields with even characteristic is further investigated. New permutation trinomials from Niho exponents are obtained from linear fractional polynomials over finite fields, and it is shown that the presented results are the generalizations of some earlier works.

متن کامل

Further results on permutation polynomials over finite fields

Article history: Received 26 August 2013 Received in revised form 24 December 2013 Accepted 3 January 2014 Available online xxxx Communicated by Rudolf Lidl MSC: 11C08 12E10

متن کامل

Swan-like results for binomials and trinomials over finite fields of odd characteristic

Swan (1962) gives conditions under which the trinomial x+x+1 over F2 is reducible. Vishne (1997) extends this result to trinomials over extensions of F2. In this work we determine the parity of the number of irreducible factors of all binomials and some trinomials over the finite field Fq, where q is a power of an odd prime.

متن کامل

New classes of permutation binomials and permutation trinomials over finite fields

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinational design, communication theory and so on. Permutation binomials and trinomials attract people’s interest due to their simple algebraic form and additional extraordinary properties. In t...

متن کامل

Symmetric bilinear forms over finite fields of even characteristic

Let Sm be the set of symmetric bilinear forms on an m-dimensional vector space over GF(q), where q is a power of two. A subset Y of Sm is called an (m, d)-set if the difference of every two distinct elements in Y has rank at least d. Such objects are closely related to certain families of codes over Galois rings of characteristic four. An upper bound on the size of (m, d)-sets is derived, and i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2017

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2016.11.011